Random groups, random graphs and eigenvalues of p-Laplacians
نویسندگان
چکیده
منابع مشابه
Noisy random graphs and their Laplacians
Spectra and representations of some special weighted graphs are investigated with weight matrices consisting of homogeneous blocks. It is proved that a random perturbation of the weight matrix or that of the weighted Laplacian with a “Wignernoise” will not have an effect on the order of the protruding eigenvalues and the representatives of the vertices will unveil the underlying block-structure...
متن کاملSparse random graphs: Eigenvalues and eigenvectors
In this paper we prove the semi-circular law for the eigenvalues of regular random graph Gn,d in the case d→∞, complementing a previous result of McKay for fixed d. We also obtain a upper bound on the infinity norm of eigenvectors of Erdős-Rényi random graph G(n, p), answering a question raised by Dekel-Lee-Linial.
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولEigenvalues of Random Power Law Graphs
Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k−β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1 + o(1)) √ m where m is the maximum degree. Moreover, the k largest eigenvalues of a random power law graph with exponent β have power l...
متن کاملEigenvalues of Random Power Law Graphs (DRAFT)
Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k−β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1+o(1)) √ m where m is the maximum degree. When 2 < β < 2.5, the largest eigenvalue is heavily concentrated at cm3−β for some constant c ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2019
ISSN: 0001-8708
DOI: 10.1016/j.aim.2018.10.035